Algebraic duality theorems with combinatorial applications
نویسندگان
چکیده
منابع مشابه
Combinatorial Integer Labeling Theorems on Finite Sets with Applications
Tucker’s well-known combinatorial lemma states that, for any given symmetric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set {±1,±2, . . . ,±n} with the property that antipodal vertices on the boundary of the cube are assigned opposite labels, the triangulation admits a 1-dimensional simplex whose tw...
متن کاملCombinatorial Proofs of Some Theorems in Algebraic Topology
Two important theorems in algebraic topology are the Brouwer Fixed Point theorem and the Borsuk-Ulam theorem. The theorems require the development of homology in their standard proofs. However, each theorem has an equivalent combinatorial result involving triangulating the relevant surface and coloring the vertices of the triangulation. Then by taking the limit of a sequence of finer triangulat...
متن کاملDuality Fixed Point and Zero Point Theorems and Applications
and Applied Analysis 3 In this paper, we firstly present the definition of duality fixed point for a mapping T from E into its dual E∗ as follows. Let E be a Banach space with a single-valued generalized duality mapping Jp : E → E∗. Let T : E → E∗. An element x∗ ∈ E is said to be a generalized duality fixed point of T if Tx∗ Jpx∗. An element x∗ ∈ E is said to be a duality fixed point of T if Tx...
متن کاملDuality Theorems and Theorems of the Alternative
It is shown, in a completely general setting, that a theorem of the alternative is logically equivalent to a duality theorem linking two constrained optimization problems. A standard technique for proving a duality theorem linking two constrained optimization problems is to apply an appropriate theorem of the alternative, sometimes called a transposition theorem (see, e.g., Mangasarian [2], Roc...
متن کاملQuasiconvex Duality Theorems with Quasiconjugates and Generator
This paper is based on the author’s thesis, “On duality theorems for quasiconvex programming”. In this paper, we investigate duality theorems for quasiconvex programming as generalizations of results in convex programming, and consists of three topics. The first topic is about quasiconjugates and polar sets. The second is about three types of set containment characterizations. The third is abou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1978
ISSN: 0024-3795
DOI: 10.1016/0024-3795(78)90066-6